ISRO CSE 2018
Q61.
Of the following sorting algorithms, which has a running time that is least dependent on the initial ordering of the input?Q62.
Given two sorted list of size m and n respectively. The number of comparisons needed the worst case by the merge sort algorithm will be:Q63.
Which of the following comparisons between static and dynamic type checking incorrect?Q64.
Given relations R(w,x) and S(y,z), the result ofSELECT DISTINCT w,xFROM R,Sis guaranteed to be same as R, ifQ65.
Consider the set of relations given below and the SQL query that follows: Students: (Roll_number, Name, Date_of_birth ) Coursed: (Course_number, Course_name, Instructor ) Grades: (Roll_number, Course_number, Grade) SELECT DISTINCT Name FROM Students, Courses, Grades WHERE Students.Roll_number = Grades.Roll_number AND Courses.Intructor =Sriram AND Courses.Course_number = Grades.Course_number AND Grades.Grade = AWhich of the following sets is computed by the above query?Q66.
The following C program: { fork(); fork(); printf("yes"); }If we execute this core segment, how many times the string yes will be printed?Q68.
Let us assume that transaction T1 has arrived before transaction T2. Consider the schedule s=r1(A);r2(B):w2(A);w1(B)Which of the following is true?Q69.
Assuming that for a given network layer implementation, connection establishment overhead is 100 bytes and disconnection overhead is 28 bytes. What would be the minimum size of the packet the transport layer needs to keep up, if it wishes to implement a datagram service above the network layer and needs to keep its overhead to a minimum of 12.5%. (ignore transport layer overhead)